Inverse Quasiconvexification

نویسندگان

چکیده

In the context of Calculus Variations for non-convex, vector variational problems, natural process going from a function $$\phi $$ to its quasiconvexification $$Q\phi is quite involved, and, most time, an impossible task. We propose look at reverse process, what might be called inverse quasiconvexification: start _0$$ , and find functions which _0=Q\phi . addition establishing few general principles, we show several explicit examples motivated by their application problems in conductivity.

منابع مشابه

Quasiconvexification in W 1,1 and optimal jump microstructure in BV relaxation

An integral representation for the relaxation in BV(Q; W) of the functional with respect to BV weak • convergence is obtained. The bulk term in the integral representation reduces to QW, the quasiconvexification of W, and it is shown exactly how optimal approximating sequences behave along 5(u), for scalar valued u.

متن کامل

Quasiconvexification in 3-d for a Variational Reformulation of an Optimal Design Problem in Conductivity

We analyze a typical 3-D conductivity problem which consists in seeking the optimal layout of two materials in a given design domain Ω ⊂ IR by minimizing the L-norm of the electric field under a constraint on the amount on each material that we can use. We utilize a characterization of the three-dimensional divergence-free vector fields which is especially appropriate for a variational reformul...

متن کامل

Inverse feasible problem

In many infeasible linear programs it is important to construct it to a feasible problem with a minimum pa-rameters changing corresponding to a given nonnegative vector. This paper defines a new inverse problem, called “inverse feasible problem”. For a given infeasible polyhedron and an n-vector a minimum perturba-tion on the parameters can be applied and then a feasible polyhedron is concluded.

متن کامل

Inverse topology in BL-algebras

In this paper, we introduce Inverse topology in a BL-algebra A and prove the set of all minimal prime filters of A, namely Min(A) with the Inverse topology is a compact space, Hausdorff, T0  and T1-Space. Then, we show that Zariski topology on Min(A) is finer than the Inverse topology on Min(A). Then, we investigate what conditions may result in the equivalence of these two topologies. Finally,...

متن کامل

Inverse Problems Have Inverse Complexity

In this paper we show that inverting problems of higher complexity is easier than inverting problems of lower complexity. While inverting Σ i 3CNFSAT is known to be coNP-complete [6] for i = 1 we prove that it remains coNP-complete for i = 2 and is in P for all i ≥ 3. Relatedly, we show that inverting Σ i 3DNFSAT is in P for all i ≥ 1.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Milan Journal of Mathematics

سال: 2021

ISSN: ['1424-9286', '1424-9294']

DOI: https://doi.org/10.1007/s00032-021-00328-9